Monotonicity of the Cd-index for Polytopes
نویسنده
چکیده
We prove that the cd-index of a convex polytope satisfies a strong monotonicity property with respect to the cd-indices of any face and its link. As a consequence, we prove for d-dimensional polytopes a conjecture of Stanley that the cd-index is minimized on the d-dimensional simplex. Moreover, we prove the upper bound theorem for the cd-index, namely that the cd-index of any d-dimensional polytope with n vertices is at most that of C(n, d), the d-dimensional cyclic polytope with n vertices.
منابع مشابه
Products of polytopes and inequalities
The cd-index is a polynomial which encodes the ag f-vector of a convex polytope. We determine explicit recurrences for computing the cd-index of the free join U _ V of two polytopes U and V and the cd-index of the Cartesian product U V. As an application of these recurrences, we prove the inequality (U _ (V W)) ((U _ V) W) involving the cd-indices of three polytopes.
متن کاملFlag enumerations of matroid base polytopes
In this paper, we study flag structures of matroid base polytopes. We describe faces of matroid base polytopes in terms of matroid data, and give conditions for hyperplane splits of matroid base polytopes. Also, we show how the cd-index of a polytope can be expressed when a polytope is split by a hyperplane, and apply these to the cd-index of a matroid base polytope of a rank 2 matroid.
متن کاملThe cd-index of Bruhat Intervals
We study flag enumeration in intervals in the Bruhat order on a Coxeter group by means of a structural recursion on intervals in the Bruhat order. The recursion gives the isomorphism type of a Bruhat interval in terms of smaller intervals, using basic geometric operations which preserve PL sphericity and have a simple effect on the cd-index. This leads to a new proof that Bruhat intervals are P...
متن کاملInequalities for cd-Indices of Joins and Products of Polytopes
The cd-index is a polynomial which encodes the flag f-vector of a convex polytope. For poly-topes U and V , we determine explicit recurrences for computing the cd-index of the free join U ∨ V and the cd-index of the Cartesian product U × V. As an application of these recurrences, we prove the inequality Ψ(U ∨ (V × W)) ≤ Ψ((U ∨ V) × W) involving the cd-indices of three polytopes.
متن کاملSIGNS IN THE cd-INDEX OF EULERIAN PARTIALLY ORDERED SETS
A graded partially ordered set is Eulerian if every interval has the same number of elements of even rank and of odd rank. Face lattices of convex polytopes are Eulerian. For Eulerian partially ordered sets, the flag vector can be encoded efficiently in the cd-index. The cd-index of a polytope has all positive entries. An important open problem is to give the broadest natural class of Eulerian ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998